منابع مشابه
NP-completeness of generalized multi-Skolem sequences
A Skolem sequence is a sequence a1, a2, . . . , a2n (where ai ∈ A = {1, . . . , n}), each ai occurs exactly twice in the sequence and the two occurrences are exactly ai positions apart. A set A that can be used to construct Skolem sequences is called a Skolem set. The existence question of deciding which sets of the form A = {1, . . . , n} are Skolem sets was solved by Thoralf Skolem [6] in 195...
متن کاملKaboozle Is NP-complete, Even in a Strip
Kaboozle is a puzzle consisting of several square cards, each annotated with colored paths and dots drawn on both sides and holes drilled. The goal is to join two colored dots with paths of the same color (and fill all holes) by stacking the cards suitably. The freedoms here are to reflect, rotate, and order the cards arbitrarily, so it is not surprising that the problem is NP-complete (as we s...
متن کاملIntroduction to Np-completeness
We use time-bounded (deterministic and nondeterministic) Turing machines to study computational complexity of decision problems. In this model, a Turing machine has two different halting states, called the accepting state and the rejecting state, respectively. We say that a Turing machine M is bounded by time T if for any input x, M on x always halts in T (|x|) moves (steps). If M is determinis...
متن کاملNP Completeness , Part 2
Example 1 Undirected Hamiltonian Path (UHP) and Undirected Hamiltonian Circuit (UHC) are the same problems as the corresponding problems for directed graphs, but the new problems are for undirected graphs. Claim 2 Given a polynomial time algorithm for Undirected Hamiltonian Path (UHP) there is a polynomial time algorithm for Directed Hamiltonian Path. 1. A DHP builds the triple (H, p, q), where...
متن کاملNP-Completeness and Disjoint NP-Pairs
We study the question of whether the class DisjNP of disjoint pairs (A,B) of NPsets contains a complete pair. The question relates to the question of whether optimal proof systems exist, and we relate it to the previously studied question of whether there exists a disjoint pair of NP-sets that is NP-hard. We show under reasonable hypotheses that nonsymmetric disjoint NP-pairs exist, which provi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Information Processing
سال: 2012
ISSN: 1882-6652
DOI: 10.2197/ipsjjip.20.713